from  heapq import merge
def merge_sort(lst):
    if len(lst)>=1:
        return lst
    mid=len(lst)//2
    left=merge_sort(lst[:mid])
    right=merge_sort(lst[mid:])
    return list(merge(left,right))

lt=merge_sort([11, 99, 33 , 69, 77, 88, 55, 11, 33, 36,39, 66, 44, 22])
print(lt)